Consequence Relations and Natural Deduction
نویسنده
چکیده
1 Consequence Relations A useful notion that cuts across both semantic (model-oriented) and syntactic (derivation-oriented) issues is the notion of a consequence relation. We will use capital Greek letters like Γ,∆ (Gamma and Delta) to refer to finite sets of formulas, and lower case Greek letters like φ, ψ (phi and psi) to refer to individual formulas. We will save ink by writing Γ,∆ for the set Γ ∪∆, and Γ, φ for the set Γ ∪ {φ}, etc. By φ[t1/x1, . . . tn/xn], we mean the result of plugging in the terms t1, . . . , tn in place of the variables x1, . . . , xn. We assume that all the xi are different variables, and that all of the plugging in happens at once. So, if there are
منابع مشابه
The Essential Inadequacy of Deductions in Logic Programming
1 Introduction In this paper we provide very broad notions of deduction and consequence for logic programs (so-called LP-deduction relations and LP-consequence relations), and we prove that under very modest assumptions, an LP-deduction relation will be either unsound or incomplete with respect to every LP-consequence relation. Throughout this paper we assume a non-logical alphabet, K, which in...
متن کاملTerms for Natural Deduction, Sequent Calculus and Cut Elimination in Classical Logic
This paper revisits the results of Barendregt and Ghilezan [3] and generalizes them for classical logic. Instead of λ-calculus, we use here λμ-calculus as the basic term calculus. We consider two extensionally equivalent type assignment systems for λμ-calculus, one corresponding to classical natural deduction, and the other to classical sequent calculus. Their relations and normalisation proper...
متن کاملSimple Consequence Relations
We provide a general investigation of Logic in which the notion of a simple consequence relation is taken to be fundamental. Our notion is more general than the usual one since we give up monotonicity and use multisets rather than sets. We use our notion for characterizing several known logics (including Linear Logic and non-monotonic logics) and for a general, semantics-independent classi cati...
متن کاملA Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory, such as LEGO, Coq, etc. In fact, ND-style systems are the kind of systems which can take best advantage of the possibility of reasoning “under assumptions” offered by proof assistants generated by Logical Frameworks....
متن کاملExtensions of Intuitionistic Logic without the Deduction Theorem: Some Simple Examples
A b s t r a c t. We provide some illustrations of consequence relations extending that associated with intuitionistic propositional logic but lacking the Deduction Theorem, together with a discussion of issues—of some interest in their own right—raised by these examples. There are two main examples, with some minor variations: one in which the language of intuitionistic logic is retained, and o...
متن کامل